The coding complexity of diffusion processes under supremum norm distortion
نویسندگان
چکیده
منابع مشابه
the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولThe Coding Complexity of Lévy Processes
In this article, we study the coding problem for real-valued Lévy processes X (original) under Lp[0, 1]-norm distortion for some fixed p ∈ [1,∞). Here we think of X being a D[0,∞)-valued process, where D[0,∞) denotes the space of càdlàg functions endowed with the Skorohod topology. We shall denote by ‖ · ‖ the standard Lp[0, 1]-norm. Let 0 < s ≤ ∞. The objective is now to find a càdlàg real-val...
متن کاملThe supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances
Recently, E.A. Emerson and C.S. Jutla (SIAM J. Comput., 1999), have successfully applied complexity of tree automata to obtain optimal deterministic exponential time algorithms for some important modal logics of programs. The running time of these algorithms corresponds, of course, to complexity functions which are potential functions and, thus, they do not belong, in general, to any dual p-com...
متن کاملHigh-resolution product quantization for Gaussian processes under sup-norm distortion
We derive high-resolution upper bounds for optimal product quantization of pathwise contionuous Gaussian processes respective to the supremum norm on [0, T ]. Moreover, we describe a product quantization design which attains this bound. This is achieved under very general assumptions on random series expansions of the process. It turns out that product quantization is asymptotically only slight...
متن کاملQuantization of probability distributions under norm-based distortion measures
For a probability measure P on R and n∈N consider en = inf ∫ min a∈α V (‖x−a‖)dP (x) where the infimum is taken over all subsets α of R with card(α) ≤ n and V is a nondecreasing function. Under certain conditions on V , we derive the precise n-asymptotics of en for nonsingular and for (singular) self-similar distributions P and we find the asymptotic performance of optimal quantizers using weig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2008
ISSN: 0304-4149
DOI: 10.1016/j.spa.2007.07.003